package 区间算法;

import java.util.LinkedList;
import java.util.List;

/**
 * https://leetcode.cn/problems/interval-list-intersections/
 *
 * 題解：https://mp.weixin.qq.com/s?__biz=MzAxODQxMDM0Mw==&mid=2247493983&idx=1&sn=f4de31dc49505225b6fe997e5a339cf8&chksm=9bd41757aca39e41bce77c816165bc8e231488dae484b323cb69ac36f924ca9b1ec3d5bc8c96&scene=178&cur_album_id=2165269406745001984#rd
 */
public class _986_区间列表的交集 {

    public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {
       return null;
    }
}
